Construction of a transitive orientation using B-stable subgraphs
نویسنده
چکیده
A special method for construction of transitive orientations of the undirected graph G = (X; U) is proposed. The method uses an iterative procedure for factorization of graph G. Factorization procedure consists in replacing of a B-stable subgraph with a vertex. Transitive orientations are obtained by a polynomial time algorithm which is presented in the paper.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملTreelike Comparability Graphs: Characterization, Recognition, and Applications
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs are distance hereditary. Utilizing this property, we give a linear time recognition algorithm. We then characterize permutation graphs that are treelike. Finally, we consider the Partitioning into Bounded Cliques pro...
متن کاملConstruction of Hybrid Gene of Hepatitis B Surface Antigen Carrying Heat-Stable Enterotoxin of Escherichia coli and Its Expression in Mammalian Cell Line
Hepatitis B surface antigen is the first genetically engineered vaccine licensed for human use. Various strategies have been proposed to obtain a vaccine that would bypass the need for injection. In this study, a non-toxic portion of heat-stable enterotoxin of Escherichia coli that is capable of adhering to epithelial cells was inserted at amino acid position 112 of hepatitis surface antigen. T...
متن کاملk-CS-transitive infinite graphs
a r t i c l e i n f o a b s t r a c t A graph Γ is k-CS-transitive, for a positive integer k, if for any two connected isomorphic induced subgraphs A and B of Γ , each of size k, there is an automorphism of Γ taking A to B. The graph is called k-CS-homogeneous if any isomorphism between two connected induced subgraphs of size k extends to an automor-phism. We consider locally-finite infinite k-...
متن کاملConstruction and Expression of a Fused Gene for B Subunit of the Heat-Labile and a Truncated Form of the Heat-Stable Enterotoxins in Escherichia coli
Elaboration of different toxins by enterotoxigenic E. coli has been considered as one of the main virulence factors contributing to the manifestation of disease caused by these microorganisms. Various strategies have been employed to raise antibodies against these toxins as a line of defense. In this study, the 3’ terminus of the gene that codes for the binding subunit of the heat-labile entero...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 23 شماره
صفحات -
تاریخ انتشار 2015